TU Berlin

Modelle und Theorie Verteilter SystemePublikationen

MTV mit Schwung

Inhalt des Dokuments

zur Navigation

Publikationen

{

Prehn, Tobias and Rotter, Myron (2019). Immediate Observation in Mediated Population Protocols. Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, Amsterdam, The Netherlands, 26th August 2019. Open Publishing Association, 102-113.

Link zur Originalpublikation

T

Sébastien Briais and Uwe Nestmann (2007). Open bisimulation, revisited. Theor. Comput. Sci., 236-271.

Link zur Publikation

Sébastien Briais and Uwe Nestmann (2007). A formal semantics for protocol narrations. Theor. Comput. Sci., 484-511.

Link zur Publikation


R

Merro, M and Kleist, J and Nestmann, U (2001). CS report 03/2001 Local pi-Calculus at Work: Mobile Objects as Mobile Processes. REPORT-UNIVERSITY OF SUSSEX COMPUTER SCIENCE

Link zur Publikation

P

Nestmann, Uwe and Puhlmann, Frank (2008). Business Process Specification and Analysis. Process Algebra for Parallel and Distributed Processing. CRC Press, 129.


Wilhelm-Weidner, Arno (2015). MobiMat – ein Framework zur Mobilisierung von Lehrmaterial. Proceedings of DeLFI Workshops 2015 co-located with 13th e-Learning Conference of the German Computer Society (DeLFI 2015). CEUR-WS.org, 239–243.

Link zur Originalpublikation

N

Uwe Nestmann and Prakash Panangaden (2003). Guest Editors' Foreword. Nord. J. Comput., 69.


M

Johannes Borgström and Uwe Nestmann (2005). On bisimulations for the spi calculus. Mathematical Structures in Computer Science, 487-552.

Link zur Publikation

Gorla, Daniele and Nestmann, Uwe (2014). Full abstraction for expressiveness: history, myths and facts. Mathematical Structures in Computer Science, 1-16.

Link zur Originalpublikation

Gorla, Daniele and Nestmann, Uwe (2016). Full abstraction for expressiveness: History, myths and facts. Mathematical Structures in Computer Science, 639–654.


Peters, Kirstin and Nestmann, Uwe (2016). Breaking Symmetries. Mathematical Structures in Computer Science, 1054–1106.


J

Luca Aceto and Jos C. M. Baeten and Wan Fokkink and Anna Ingólfsdóttir and Uwe Nestmann (2009). Preface. J. Log. Algebr. Program.

Link zur Originalpublikation

Uwe Nestmann and Björn Victor (2005). Guest editors' introduction: Special issue on The pi-calculus. J. Log. Algebr. Program., 1-2.

Link zur Publikation

I

Uwe Nestmann and Hans Hüttel and Josva Kleist and Massimo Merro (2002). Aliasing Models for Mobile Objects. Inf. Comput., 3-33.

Link zur Publikation

Massimo Merro and Josva Kleist and Uwe Nestmann (2002). Mobile Objects as Mobile Processes. Inf. Comput., 195-241.

Link zur Publikation

Uwe Nestmann (2000). What is a "Good" Encoding of Guarded Choice?. Inf. Comput., 287-319.


Uwe Nestmann and Benjamin C. Pierce (2000). Decoding Choice Encodings. Inf. Comput., 1-59.


F

Nestmann, Uwe (2013). 3.12 Verifying Consensus... Using Process Calculi, State Machines, and Proof Checkers. Formal Verification of Distributed Algorithms, 10.

Link zur Publikation

E

Sébastien Briais and Uwe Nestmann (2006). Open Bisimulation, Revisited. Electr. Notes Theor. Comput. Sci., 109-123.

Link zur Publikation

Rachele Fuzzati and Uwe Nestmann (2006). Much Ado About Nothing?. Electr. Notes Theor. Comput. Sci., 167-171.

Link zur Publikation

Flavio Corradini and Uwe Nestmann (2004). Foreword: Proceedings of the 10th International Workshop on Expressiveness in Concurrency. Electr. Notes Theor. Comput. Sci., 1-3.

Link zur Publikation

Uwe Nestmann and Prakash Panangaden (2002). Preface. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann (1998). On the Expressive Power of Joint Input. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann and Benjamin C. Pierce (1998). Preface. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann (1997). What is a `good' encoding of guarded choice?. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

D

Schmuck, Anne-Kathrin and Schneider, Sven and Raisch, Jörg and Nestmann, Uwe (2015). Supervisory control synthesis for deterministic context free specification languages. Discrete Event Dynamic Systems. Springer US, 1-28.

Link zur Originalpublikation

Schmuck, Anne-Kathrin and Schneider, Sven and Raisch, Jörg and Nestmann, Uwe (2016). Supervisory control synthesis for deterministic context free specification languages. Discrete Event Dynamic Systems. Springer US, 5–32.


C



Arbach, Youssef and Karcher, David and Peters, Kirstin and Nestmann, Uwe (2015). Dynamic Causality in Event Structures (Technical Report). CoRR

Link zur Publikation

Peters, Kirstin and Nestmann, Uwe (2010). Breaking Symmetries. CoRR

Link zur Publikation

Hatzel, Meike and Wagner, Christoph and Peters, Kirstin and Nestmann, Uwe (2015). Encoding CSP into CCS (Extended Version). CoRR

Link zur Publikation

Peters, Kirstin and Yonova-Karbe, Tsvetelina and Nestmann, Uwe (2014). Matching in the Pi-Calculus (Technical Report). CoRR

Link zur Publikation

B

Uwe Nestmann and Björn Victor (1998). Calculi for Mobile Processes - Bibliography and Web Pages. Bulletin of the EATCS


Aceto, Luca and Baeten, Jos CM and Fokkink, Wan and Ingolfsdottir, Anna and Nestmann, Uwe (2008). Applying Concurrency Research in Industry Report on a Strategic Workshop. Bulletin of the EATCS, 113–129.


a

Adameit, Manuel and Peters, Kirstin and Nestmann, Uwe (2016). Session Types for Link Failures (Technical Report). arXiv preprint arXiv:1607.07286

Link zur Publikation

A

Bisping, Benjamin and Brodmann, Paul-David and Jungnickel, Tim and Rickmann, Christina and Seidler, Henning and Stüber, Anke and Wilhelm-Weidner, Arno and Peters, Kirstin and Nestmann, Uwe (2016). A Constructive Proof for FLP. Archive of Formal Proofs


Rachele Fuzzati and Massimo Merro and Uwe Nestmann (2007). Distributed Consensus, revisited. Acta Inf., 377-425.

Link zur Originalpublikation

Peters, Kirstin and Wagner, Christoph and Nestmann, Uwe (2019). Taming Concurrency for Verification Using Multiparty Session Types. Theoretical Aspects of Computing – ICTAC 2019. Lecture Notes in Computer Science. Springer, Cham, 196-215.

Link zur Originalpublikation

Wilhelm-Weidner, Arno and Bergner, Nadine (2018). Vergleich von Lernstilen und deren Umsetzungsmöglichkeiten im LMS Moodle. Das Elektronische Schulbuch 2017: Fachdidaktische Anforderungen und Ideen treffen auf Lösungsvorschläge der Informatik. LIT Verlag, 25–37.


Wilhelm-Weidner, Arno and Bergner, Nadine (2018). On Supplementing Theoretical Computer Science Courses Using E-Learning. Proceedings of the 18th Koli Calling International Conference on Computing Education Research. ACM, 14:1–14:10.

Link zur Publikation

Wolf, Alexander and Wilhelm-Weidner, Arno and Nestmann, Uwe (2018). A Case Study of Flipped Classroom for Automata Theory in Secondary Education. Proceedings of the 13th Workshop in Primary and Secondary Computing Education. ACM, 23:1–23:6.

Link zur Publikation

Morten Kühnrich and Uwe Nestmann (2009). On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems. FMOODS/FORTE, 198-212.

Link zur Originalpublikation


Florian Eilers and Uwe Nestmann (2009). Deriving Trust from Experience. Formal Aspects in Security and Trust, 36-50.

Link zur Originalpublikation


Wagner, Christoph and Nestmann, Uwe (2014). States in Process Calculi. EXPRESS/SOS, 48-62.

Link zur Publikation



Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe